Towards Efficient Encoding Using Polynomials
نویسنده
چکیده
We present an efficient new method of obtaining a generator matrix G from certain types of parity check matrices with a defective cyclic block structure. This novel approach describes parity check and generator matrices in terms of polynomials. Moreover, by using this polynomial algebra we have found efficient ways to implement the scheme. In addition, this method is as such interesting as it allows us to convert H into G without a systematic encoder in between (i.e., there is no diagonal subpart in the output). This alone is interesting as normally G would be dense if we were to form it from the given H by Gaussian elimination.
منابع مشابه
A Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملA numerical study of electrohydrodynamic flow analysis in a circular cylindrical conduit using orthonormal Bernstein polynomials
In this work, the nonlinear boundary value problem in electrohydrodynamics flow of a fluid in an ion-drag configuration in a circular cylindrical conduit is studied numerically. An effective collocation method, which is based on orthonormal Bernstein polynomials is employed to simulate the solution of this model. Some properties of orthonormal Bernstein polynomials are introduced and utilized t...
متن کاملNumerical solution of nonlinear Fredholm-Volterra integral equations via Bell polynomials
In this paper, we propose and analyze an efficient matrix method based on Bell polynomials for numerically solving nonlinear Fredholm- Volterra integral equations. For this aim, first we calculate operational matrix of integration and product based on Bell polynomials. By using these matrices, nonlinear Fredholm-Volterra integral equations reduce to the system of nonlinear algebraic equations w...
متن کاملAerodynamic Design Optimization Using Genetic Algorithm (RESEARCH NOTE)
An efficient formulation for the robust shape optimization of aerodynamic objects is introduced in this paper. The formulation has three essential features. First, an Euler solver based on a second-order Godunov scheme is used for the flow calculations. Second, a genetic algorithm with binary number encoding is implemented for the optimization procedure. The third ingredient of the procedure is...
متن کاملCan you save time in multiplying polynomials by encoding them as integers?/revised 2010
Encoding a univariate polynomial as a long integer conceptually unifies some processing tasks on polynomials with those on integers, including multiplication. An evaluation of a polynomial at a single point is sufficient to encode and decode all its coefficients if the point is sufficiently larger than the coefficients. This is sometimes referred to as “Kronecker’s trick”. We show that this ide...
متن کامل